Global Definability in Basic Modal Logic
نویسندگان
چکیده
We present results on global definability in basic modal logic, and contrast our model-theoretic results and proof techniques with known results about local definability.
منابع مشابه
Global vs. Local in Basic Modal Logic
We discuss results on global definability in basic modal logic, and contrast our model-theoretic results and proof techniques with known results about local definability.
متن کاملA generalization of modal definability
Known results on global definability in basic modal logic are generalized in the following sense. A class of Kripke models is usually called modally definable if there is a set of modal formulas such that a class consists exactly of models on which every formula of that set is globally true, i. e. universally quantified standard translations of these formulas to the corresponding first order la...
متن کاملFrame Correspondences in Modal Predicate Logic
Understanding modal predicate logic is a continuing challenge, both philosophical and mathematical. In this paper, I study this system in terms of frame correspondences, finding a number of definability results using substitution methods, including new analyses of axioms in intermediate intuitionistic predicate logics. The semantic arguments often have a different flavour from those in proposit...
متن کاملCharacterization and definability in modal first-order fragments
Characterization results for modal logics below first order identifies them as a fragment of first order logic. These results are very important to analyze the expressive power of a given logic. The first work in this direction was done by van Benthem [12] who used bisimulations to characterize the basic modal logic as the bisimulation invariant fragment of first order logic. There exists a hug...
متن کاملCharacterization, definability and separation via saturated models
Three important results about the expressivity of a modal logic L are the Characterization Theorem (that identifies a modal logic L as a fragment of a better known logic), the Definability theorem (that provides conditions under which a class of L-models can be defined by a formula or a set of formulas of L), and the Separation Theorem (that provides conditions under which two disjoint classes ...
متن کامل